منابع مشابه
Combining Norms to Prove Termination
Automatic termination analysers typically measure the size of terms applying norms which are mappings from terms to the natural numbers. This paper illustrates how to enable the use of size functions defined as tuples of these simpler norm functions. This approach enables us to simplify the problem of deriving automatically a candidate norm with which to prove termination. Instead of deriving a...
متن کاملA Transformational Approach to Prove Outermost Termination Automatically
We present transformations from a generalized form of left-linear TRSs, called quasi left-linear TRSs, to TRSs such that outermost termination of the original TRS can be concluded from termination of the transformed TRS. In this way we can apply state-of-the-art termination tools for automatically proving outermost termination of any given quasi left-linear TRS. Experiments show that this works...
متن کاملUsing Rippling to Prove the Termination of Algorithms
c Deutsches Forschungszentrum f ¨ ur K ¨ unstliche Intelligenz 1997 This work may not be copied or reproduced in whole of part for any commercial purpose. Permission to copy in whole or part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Deu...
متن کاملUsing Induction to Prove Properties of Distributed Programs
Proofs of distributed programs are often informal due to the diiculty of developing formal proofs. Properties of distributed programs are often stated using Lamport's causally-precedes relation and its complement , not-causally-precedes. Properties that involve the causally-precedes relation are fairly straight forward to prove using induction. However, properties that involve not-causally-prec...
متن کاملA logical framework to prove properties of Alpha programs
We present an assertional approach to prove properties of Alpha programs. Alpha is a functional language based on aane recurrence equations. We rst present two kinds of operational semantics for Alpha together with some equivalence and connuence properties of these semantics. We then present an attempt to provide Alpha with an external logical framework. We therefore deene a proof method based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.320.10